#include<bits/stdc++.h>
using namespace std;
const int N=1e5+10;
int n,a[N],q[N],hh,tt;
int main()
{
    freopen("duel.in","r",stdin);
    freopen("duel.out","w",stdout);
    scanf("%d",&n);
    hh=0;tt=-1;
    for(int i=1;i<=n;i++)
        scanf("%d",&a[i]);
    sort(a+1,a+n+1);
    q[++tt]=a[1];
    for(int i=2;i<=n;i++)
    {
        int t=q[hh];
        q[++tt]=a[i];
        if(a[i]>t) hh++;
    }
    printf("%d",tt-hh+1);
    return 0;
}
